منابع مشابه
ROAST: Rapid Orthogonal Approximate Slepian Transform
In this paper, we provide a Rapid Orthogonal Approximate Slepian Transform (ROAST) for the discrete vector one obtains when collecting a finite set of uniform samples from a baseband analog signal. The ROAST offers an orthogonal projection which is an approximation to the orthogonal projection onto the leading discrete prolate spheroidal sequence (DPSS) vectors (also known as Slepian basis vect...
متن کاملThe Fast Gauss Transform
Many problems in applied mathematics require the evaluation of the sum of N Gaussians at M points in space. The work required for direct evaluation grows like NM as N and M increase; this makes it very expensive to carry out such calculations on a large scale. In this paper, an algorithm is presented which evaluates the sum of N Gaussians at M arbitrarily distributed points in C. (N + M) work, ...
متن کاملThe Fast Fourier Transform
In the next two lectures, we will continue to expand our toolbox for computing in frequency domain, by adding two important computational tools. The first, the Fast Fourier Transform (FFT) is a family of algorithms for efficiently computing the Discrete Fourier Transform. These algorithms are of great practical importance, as theymake it possible to perform frequency domain analysis of very lar...
متن کاملThe Fast Wavelet Transform
The Fourier transform has been used as a reliable tool in signal analysis for many years. Invented in the early 1800s by its namesake, Jean Baptiste Joseph Fourier, the Fourier transform has become a cornerstone of modern signal analysis. The Fourier transform has proven incredibly versatile in applications ranging from patten recognition to image processing. Nevertheless, it suuers from certai...
متن کاملThe Future Fast Fourier Transform?
It seems likely that improvements in arithmetic speed will continue to outpace advances in communications bandwidth. Furthermore, as more and more problems are working on huge datasets, it is becoming increasingly likely that data will be distributed across many processors because one processor does not have sufficient storage capacity. For these reasons, we propose that an inexact DFT such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2019
ISSN: 1063-5203
DOI: 10.1016/j.acha.2017.07.005